Single Jog Minimum Area Joining of Compacted Cells

Minimum area joining of compacted cells

Compaction on the Torus

In this paper we introduce a general framework for compaction on a torus. This problem comes up whenever an array of identical cells has to be compacted. We instantiate our framework with several specific compaction algorithms: one-dimensional compaction without and with automatic jog insertion and two-dimensional com-

Efficient Cellular Automata Algorithms for Planar Graph and VLSI Layout Homotopic Compaction

One-dimensional homotopic compaction is defined as; In a given routable layout, a layout of minimum width is reachable by operations that can move each module horizontally as a unit, also deform lines maintaining their connections and maintain their routability. This paper exploits the nature of parallelism of this problem and introduces an efficient cellular automata algorithm for homotopic co...

Compacting a Single Flow Diverter versus Overlapping Flow Diverters for Intracranial Aneurysms: A Computational Study.

BACKGROUND AND PURPOSE Locally compacting the mesh of a flow diverter by a dynamic push-pull technique can accelerate intracranial aneurysm healing. We asked how this deployment strategy compares with overlapping 2 flow diverters for aneurysmal flow reduction. MATERIALS AND METHODS Using a high-fidelity virtual stent placement method, we simulated 3 flow-diverter strategies (single noncompact...

Bacterial nonhomologous end joining requires teamwork.

All living organisms must repair DNA double-stranded breaks (DSBs) in order to survive. Many bacteria rely on nonhomologous end joining (NHEJ) when only a single copy of the genome is available and maintain NHEJ pathways with a minimum of two proteins. In this issue, Bhattarai and colleagues identify additional factors that can work together to aid in survival of stationary-phase cells with chr...